import java.util.ArrayList;
import java.util.List;

/**
 * Created with IntelliJ IDEA.
 * Description://今天太恶心了 不想做了 暑假再卷
 * User: dings
 * Date: 2024-06-05
 * Time: 18:35
 */
class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int len = nums1.length;
        int[] arr = new int[len];
        int index1 = 0;
        int index2 = 0;
        int newIndex = 0;
        while (index1 < m && index2 < n) {
            if(nums1[index1] < nums2[index2]) {
                arr[newIndex] = nums1[index1];
                newIndex++;
                index1++;
            }else {
                arr[newIndex] = nums2[index2];
                newIndex++;
                index2++;
            }
        }
        if(index1 == m) {
            arr[newIndex] = nums2[index2];
            newIndex++;
            index2++;
        }
        if(index2 == n) {
            arr[newIndex] = nums2[index2];
            newIndex++;
            index2++;
        }
        for (int i = 0; i < ; i++) {
            
        }
    }

    public static void main(String[] args) {

        ArrayList<Integer> arrayList = new ArrayList<>();
        List<Integer> list1 = new ArrayList<>();
        List<List<Integer>> list= new ArrayList<>();
        List<ArrayList<Integer>> list2= new ArrayList<>();
    }
}